A globally convergent interior point algorithm for non-convex nonlinear programming
نویسندگان
چکیده
منابع مشابه
A globally convergent primal-dual interior point algorithm for convex programming
In this paper, we study the global convergence of a large class of primal--dual interior point algorithms for solving the linearly constrained convex programming problem. The algorithms in this class decrease the value of a primal--dual potential function and hence belong to the class of so-called potential reduction algorithms. An inexact line search based on Armijo stepsize rule is used to co...
متن کاملA Simple, Quadratically Convergent Interior Point Algorithm for Linear Programming and Convex Quadratic Programming
An algorithm for linear programming (LP) and convex quadratic programming (CQP) is proposed, based on an interior point iteration introduced more than ten years ago by J. Herskovits for the solution of nonlinear programming problems. Herskovits' iteration can be simpliied signiicantly in the LP/CQP case, and quadratic convergence from any initial point can be achieved. Interestingly the linear ...
متن کاملA globally convergent primal-dual interior-point filter method for nonlinear programming
In this paper, the filter technique of Fletcher and Leyffer (1997) is used to globalize the primaldual interior-point algorithm for nonlinear programming, avoiding the use of merit functions and the updating of penalty parameters. The new algorithm decomposes the primal-dual step obtained from the perturbed first-order necessary conditions into a normal and a tangential step, whose sizes are co...
متن کاملA globally convergent primal-dual interior-point three-dimensional filter method for nonlinear semidefinite programming
This paper proposes a primal-dual interior-point filter method for nonlinear semidefinite programming, which is the first multidimensional (three-dimensional) filter methods for interior-point methods, and of course for constrained optimization. A freshly new definition of filter entries is proposed, which is greatly different from those in all the current filter methods. A mixed norm is used t...
متن کاملA Globally Convergent Primal-Dual Interior-Point Filter Method for Nonconvex Nonlinear Programming
In this paper, the filter technique of Fletcher and Leyffer (1997) is used to globalize the primaldual interior-point algorithm for nonlinear programming, avoiding the use of merit functions and the updating of penalty parameters. The new algorithm decomposes the primal-dual step obtained from the perturbed first-order necessary conditions into a normal and a tangential step, whose sizes are co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2009
ISSN: 0377-0427
DOI: 10.1016/j.cam.2008.05.043